On the Dual Approach to Recursive Optimization

نویسندگان

  • Matthias Messner
  • Nicola Pavoni
  • Christopher Sleet
چکیده

We bring together the theories of duality and dynamic programming. We show that the dual of an additively separable dynamic optimization problem can be recursively decomposed using summaries of past Lagrange multipliers as state variables. Analogous to the Bellman decomposition of the primal problem, we prove equality of values and solution sets for recursive and sequential dual problems. In nonadditively separable settings, the equivalence of the recursive and sequential dual is not guaranteed. We relate recursive dual and recursive primal problems. If the Lagrangian associated with a constrained optimization problem admits a saddle then, even in nonadditively separable settings, the values of the recursive dual and recursive primal problems are equal. Additionally, the recursive dual method delivers necessary conditions for a primal optimum. If the problem is strictly concave, the recursive dual method delivers necessary and sufficient conditions for a primal optimum. When a saddle exists, states on the optimal dual path are subdifferentials of the primal value function evaluated at states on the optimal primal path and vice versa.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Recursive Formulation for the Mixed Redundancy Strategy in Reliability Optimization Problems

One of the common approaches for improving the reliability of a specific system is to use parallel redundant components in subsystems. This approach, which is known as the redundancy allocation problem (RAP), includes the simultaneous selection of the component type and its level for each subsystem in order to maximize the system reliability.Traditionally, there are two redundancy strategies, n...

متن کامل

AIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems

The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...

متن کامل

MULTIOBJECTIVE OPTIMIZATION OF SENSOR PLACEMENT IN WATER DISTRIBUTION NETWORKS DUAL USE BENEFIT APPROACH

Location and types of sensors may be integrated for simultaneous achievement of water security goals and other water utility objectives, such as regulatory monitoring requirements. Complying with the recent recommendations on dual benefits of sensors, this study addresses the optimal location of these types of sensors in a multipurpose approach. The study presents two mathematical models for ...

متن کامل

A Novel Reference Current Calculation Method for Shunt Active Power Filters using a Recursive Algebraic Approach

This paper presents a novel method to calculate the reference source current and the referencecompensating current for shunt active power filters (SAPFs). This method first calculates theamplitude and phase of the fundamental load current from a recursive algebraic approach blockbefore calculating the displacement power factor. Next, the amplitude of the reference mains currentis computed with ...

متن کامل

A New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming

‎This paper describes a new optimization method for solving continuous semi-infinite linear problems‎. ‎With regard to the dual properties‎, ‎the problem is presented as a measure theoretical optimization problem‎, ‎in which the existence of the solution is guaranteed‎. ‎Then‎, ‎on the basis of the atomic measure properties‎, ‎a computation method was presented for obtaining the near optimal so...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011